#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;

ll gcd(ll a, ll b, ll& x, ll& y) {
  if (!b) {
    x = 1, y = 0;
    return a;
  } else {
    ll d = gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
  }
}

void solve() {
  ll a, b, c;
  cin >> a >> b >> c;
  bool na = a < 0, nb = b < 0;
  a = abs(a), b = abs(b);
  ll x, y;
  ll d = gcd(a, b, x, y);
  if (c % d != 0) {
    cout << -1 << endl;
    return;
  }
  x *= -c / d, y *= -c / d;
  if (na) x *= -1;
  if (nb) y *= -1;
  cout << x << ' ' << y << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}